Fault-tolerant Quality-of-service-enabled Distributed Mutual Exclusion for Message-Oriented Middleware

نویسندگان

  • James Edmondson
  • Douglas C. Schmidt
  • Aniruddha Gokhale
چکیده

Distributed mutual exclusion is the process of ensuring exclusive access to a shared resource between multiple competing threads of execution in a distributed system. Despite the utility of distributed mutual exclusion, conventional messageoriented middleware generally does not support this feature, so application developers who need it must create their own ad hoc solutions, which are often inefficient and error-prone. This paper provides two contributions to research on distributed mutual exclusion for message-oriented middleware. First, we describe a quality-of-service (QoS)-enabled distributed algorithm called Prioritizable Adaptive Distributed Mutual Exclusion (PADME) that can be implemented in most message-oriented middleware platforms and which provides high critical section throughput, reduced average synchronization delay, fault tolerance, and priority inversion avoidance. Second, we evaluate the performance of PADME and analyze its QoS and critical section throughput in a representative message-oriented middleware environment. Our results show that the rich feature set of the PADME algorithm addresses a range of application QoS requirements and can reduce synchronization delay to a single message transmission.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems

Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...

متن کامل

A Scalable Durable Grid Event Service

It is interesting to study the system and software architecture of environments, which integrate the evolving ideas of computational grids, distributed objects, web services, peer-to-peer networks and message oriented middleware. Such peer-to-peer (P2P) Grids should seamlessly integrate users to themselves and to resources, which are also linked to each other. We can abstract such environments ...

متن کامل

Fault-Tolerant Distributed Match-Making with Weights - Parallel and Distributed Systems, 1996. Proceedings., 1996 International Conference on

Protocols to solve several distributed issues, such as name service, mutual exclusion, and creation of an atomic shared register, require two types of subsets with intersection property. Distributed matchmaking provides a method of creating the subsets, and the lower bound of the number of messages t o solve the issues. This paper discusses the fault-tolerant and weighted case, in which a proto...

متن کامل

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

A Distributed Mutual Exclusion Algorithm for Mobile Ad Hoc Networks

We propose a distributed mutual exclusion algorithm for mobile ad hoc networks. This algorithm requires a ring of cluster coordinators as the underlying topology. The topology is built by first providing clusters of mobile nodes in the first step and then forming a backbone consisting of the cluster heads in a ring as the second step. The modified version of the Ricart-Agrawala Algorithm on top...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010